A finite set of functions with an EXPTIME-complete composition problem
نویسندگان
چکیده
منابع مشابه
A finite set of functions with an EXPTIME-complete composition problem
We exhibit a finite family of functions over a finite set (i.e. a finite algebra) such that the problem whether a given function can be obtained as a composition of the members of this family (i.e. is a member of the clone generated by the algebra) is EXPTIME-complete.
متن کاملFinite LTL Synthesis is EXPTIME-complete
LTL synthesis – the construction of a function to satisfy a logical specification formulated in Linear Temporal Logic – is a 2EXPTIME-complete problem with relevant applications in controller synthesis and a myriad of artificial intelligence applications. In this research note we consider De Giacomo and Vardi’s variant of the synthesis problem for LTL formulas interpreted over finite rather tha...
متن کاملThe Resolution Width Problem is EXPTIME-Complete
The importance of width as a resource in resolution theorem proving has been emphasized in the work of Ben-Sasson and Wigderson. Their results show that lower bounds on the size of resolution refutations can be proved in a uniform manner by demonstrating lower bounds on the width of refutations, and that there is a simple dynamic programming procedure for automated theorem proving based on the ...
متن کاملDeciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete
Finite-state tree automata are a well studied formalism for representing term languages. This paper studies the problem of determining the regularity of the set of instances of a finite set of terms with variables, where each variable is restricted to instantiations of a regular set given by a tree automaton. The problem was recently proved decidable, but with an unknown complexity. Here, the e...
متن کاملGround Reducibility is EXPTIME-Complete
We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the computations of an alternating Turing machine whose space is polynomially bounded. It is more difficult to show that ground reducibility belongs to DEXPTIME. We associate first an automaton with disequality constraints AR;t to a rewrite system R and a term t. This automaton is d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.06.057